Creative 3D Designs Using Interactive Genetic Algorithm with Structured Directed Graph

نویسندگان

  • Hyeun-Jeong Min
  • Sung-Bae Cho
چکیده

We propose a methodology for representing artificial creatures like 3D flowers. Directed graph and Lindenmayer system (L-system) are commonly involved in AI-based creativity research for encoding ceatures. It is difficult for L-systems to directly feed back real morphologies structurally from their genotypes, since they are a grammatical rewriting system and also use parameters such as loops, procedure calls, variables, and primitive parameters for representing their genotypes. In this paper flower genotypes are manifested by a knowledge-based structured directed graph (SDG) and phenotypes are represented a flower morphology resulting from the derivation and graphical representation of the genotypes. Evolution is simulated using an interactive genetic algorithm (IGA), where a SDG is useful for genotypic representation of creatures and IGA uses human evaluation for the fitness function. We have applied the creation of 3D flowers using the knowledge-based SDG and IGA. Experimental results show that realistic flower morphologies can be created by the proposed method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Collaborative Evolution of 3D Models

We present a computational model of creative design based on collaborative interactive genetic algorithms. In our model, designers individually guide interactive genetic algorithms (IGAs) to generate and explore potential design solutions quickly. Collaboration is supported by allowing designers to share solutions amongst each other while using IGAs, with the sharing of solutions adding variabl...

متن کامل

Interactive 3D Force-Directed Edge Bundling

Interactive analysis of 3D relational data is challenging. A common way of representing such data are node-link diagrams as they support analysts in achieving a mental model of the data. However, naïve 3D depictions of complex graphs tend to be visually cluttered, even more than in a 2D layout. This makes graph exploration and data analysis less efficient. This problem can be addressed by edge ...

متن کامل

A Focus and Constraint-Based Genetic Algorithm for Interactive Directed Graph Drawing

This paper presents a user-driven genetic algorithm for directed graph drawing. An interactive framework is considered where users can focus the algorithm on regions of the drawing that need major improvement, or include domain knowledge as layout constraints. The paper describes how focus and user constraints are managed by the genetic algorithm. The combination of user’s skills with automatic...

متن کامل

A new Shuffled Genetic-based Task Scheduling Algorithm in Heterogeneous Distributed Systems

Distributed systems such as Grid- and Cloud Computing provision web services to their users in all of the world. One of the most important concerns which service providers encounter is to handle total cost of ownership (TCO). The large part of TCO is related to power consumption due to inefficient resource management. Task scheduling module as a key component can has drastic impact on both user...

متن کامل

The topological ordering of covering nodes

The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological orderingalgorithm on graphs containing the covering nodes. We show that there exists a cut set withforward arcs in these...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004